A Note on NP ∩ coNP / poly
نویسنده
چکیده
In this note we show that AMexp 6⊆ NP ∩ coNP/poly, where AMexp denotes the exponential version of the class AM. The main part of the proof is a collapse of EXP to AM under the assumption that EXP ⊆ NP ∩ coNP/poly
منابع مشابه
Consequences of the provability of NP ⊆ P/poly
We prove the following results: (i) PV proves NP ⊆ P/poly iff PV proves coNP ⊆ NP/O(1). (ii) If PV proves NP ⊆ P/poly then PV proves that the Polynomial Hierarchy collapses to the Boolean Hierarchy. (iii) S2 proves NP ⊆ P/poly iff S 1 2 proves coNP ⊆ NP/O(log n). (iv) If S2 proves NP ⊆ P/poly then S 1 2 proves that the Polynomial Hierarchy collapses to P[log n]. (v) If S2 proves NP ⊆ P/poly the...
متن کاملComplicated Complementations
Kolmogorov complexity has proven to be a very useful tool in simplifying and improving proofs that use complicated combinatorial arguments. In this paper we use Kolmogorov complexity for oracle construction. We obtain separation results that are much stronger than separations obtained previously even with the use of very complicated combinatorial arguments. Moreover the use of Kolmogorov argume...
متن کاملNondeterministically Selective Sets
In this note, we study NP-selective sets (formally, sets that are selective via NPSVt functions) as a natural generalization of P-selective sets. We show that, assuming P 6 = NP \coNP, the class of NP-selective sets properly contains the class of P-selective sets. We study several properties of NP-selective sets such as self-reducibility, hardness under various reductions, lowness, and nonunifo...
متن کاملCompeting Provers Yield Improved Karp-Lipton Collapse Results
Via competing provers, we show that if a language A is self-reducible and has polynomial-size circuits then S2 = S2. Building on this, we strengthen the Kämper– AFK Theorem, namely, we prove that if NP ⊆ (NP ∩ coNP)/poly then the polynomial hierarchy collapses to SNP∩coNP 2 . We also strengthen Yap’s Theorem, namely, we prove that if NP ⊆ coNP/poly then the polynomial hierarchy collapses to SNP...
متن کاملSome Remarks on the Incompressibility of Width-Parameterized SAT Instances
Compressibility regards the reduction the length of the input, or of some other parameter, preserving the solution. Any 3-SAT instance on N variables can be represented by O(N) bits. [4] proved that the instance length in general cannot be compressed to O(N3−!) bits under the assumption NP !⊆ coNP/poly, which implies that the polynomial hierarchy collapses. This note initiates and puts forward ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000